Warm Starting Variational Quantum Algorithms with Near Clifford Circuits

نویسندگان

چکیده

As a mainstream approach in the quantum machine learning field, variational algorithms (VQAs) are frequently mentioned among most promising applications for computing. However, VQAs suffer from inefficient training methods. Here, we propose pretraining strategy named near Clifford circuits warm start (NCC-WS) to find initialization parameterized (PQCs) VQAs. We explored expressibility of NCCs and correlation between acceleration. The achieved results suggest that NCC-WS can correct achieve

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Advantage from Conjugated Clifford Circuits

A well-known result of Gottesman and Knill [Got99] states that Clifford circuits – i.e. circuits composed of only CNOT, Hadamard, and π/4 phase gates – are efficiently classically simulable. We show that in contrast, “conjugated Clifford circuits” (CCCs) – where one additionally conjugates every qubit by the same one-qubit gate U – can perform hard sampling tasks. In particular, we fully classi...

متن کامل

Representation of Quantum Circuits with Clifford and π/8 Gates

In this paper, we introduce the notion of a normal form of one qubit quantum circuits over the basis {H,P, T}, where H , P and T denote the Hadamard, Phase and π/8 gates, respectively. This basis is known as the standard set and its universality has been shown by Boykin et al. [FOCS ’99]. Our normal form has several nice properties: (i) Every circuit over this basis can easily be transformed in...

متن کامل

Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates.

We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominate...

متن کامل

Generalized clifford groups and simulation of associated quantum circuits

Quantum computations that involve only Clifford operations are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the theorem and provide generalisations of some of them with the aim of identifying new classes of simulable quantum computations. In the usual construction, Cliffo...

متن کامل

Towards Practical Quantum Variational Algorithms

The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be executed without quantum error correction. Such quantum state preparation can be used in variational approaches, optimizing parameters in the circuit to minimi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2023

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics12020347